Eccentricity Lifting (Graph to Complex) #10
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
Check out this pull request on See visual diffs & provide feedback on Jupyter Notebooks. Powered by ReviewNB |
Jonas-Verhellen
changed the title
|
Hello @Jonas-Verhellen! Thank you for your submission. As we near the end of the challenge, I am collecting participant info for the purpose of selecting and announcing winners. Please email me (or have one member of your team email me) at guillermo_bernardez@ucsb.edu so I can share access to the voting form. In your email, please include:
Before July 12, make sure that your submission respects all Submission Requirements laid out on the challenge page. Any submission that fails to meet this criteria will be automatically disqualified. |
gbg141
added
award-category-1
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The EccentricityComplexLifting class provides a method to transform a graph into a simplicial complex based on the eccentricity of its vertices. This lifting captures the topology of the graph by forming simplices that reflect the hierarchical structure of vertex neighborhoods, determined by the eccentricity distance. This provides a measure of the spread of each vertex within the graph.
For each vertex, its neighborhood within the eccentricity distance is determined. Simplices are formed from combinations of vertices within each neighborhood. The node features from the original graph are preserved and added to the corresponding nodes in the simplicial complex. Potentially of interest for networks where the spread or influence of a node is of interest, such as in epidemic modeling or information propagation.